A Matter of Trust: Skeptical Communication Between Coq and External Provers (Detailed Description)

نویسنده

  • Chantal Keller
چکیده

Most theorem provers are either hard to trust because they are large programs or hard to use due to a lack of automation. They are thus used by two di erent communities depending on the property one needs most: the ability to prove quickly a large amount of theorems or a high level of safety. My thesis studies a communication between these di erent kinds of tools, by asking for proof witnesses in addition to yes/no answers from automated provers, and checking them in safe provers. It o ers both a way to safely combine proofs coming from all these provers in order to bene t from the advantages of all of them and guaranties to automated theorem provers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Matter of Trust: Skeptical Communication Between Coq and External Provers. (Question de confiance : communication sceptique entre Coq et des prouveurs externes)

This thesis studies the cooperation between the Coq proof assistant and external provers through proof witnesses. We concentrate on two di erent kinds of provers that can return certi cates: rst, answers coming from SAT and SMT solvers can be checked in Coq to increase both the con dence in these solvers and Coq's automation; second, theorems established in interactive provers based on Higher-O...

متن کامل

Towards the Integration of an Intuitionistic First-Order Prover into Coq

Sledgehammer [11] and HOLyHammer [5] drastically improved the productivity for users of proof assistants. They make the capabilities of automated theorem provers (ATPs) available from within interactive proof assistants. The large, monolithic design of state-of-the-art theorem provers can not be easily trusted to be free of bugs. Thus invoking theorem provers as an oracle is unacceptable for mo...

متن کامل

A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses

We present a way to enjoy the power of SAT and SMT provers in Coq without compromising soundness. This requires these provers to return not only a yes/no answer, but also a proof witness that can be independently rechecked. We present such a checker, written and fully certified in Coq. It is conceived in a modular way, in order to tame the proofs’ complexity and to be extendable. It can current...

متن کامل

Verifying SAT and SMT in Coq for a fully automated decision procedure

Enjoying the power of SAT and SMT solvers in the Coq proof assistant without compromising soundness requires more than a yes/no answer from them. SAT and SMT solvers should also return a proof witness that can be checked by an external tool. We propose a fully certified checker for such witnesses written in Coq. It can currently check witnesses from the SAT solvers ZChaff and MiniSat and from t...

متن کامل

Partiality and recursion in interactive theorem provers - an overview

The use of interactive theorem provers to establish the correctness of critical parts of a software development or for formalising mathematics is becoming more common and feasible in practice. However, most mature theorem provers lack a direct treatment of partial and general recursive functions; overcoming this weakness has been the objective of intensive research during the last decades. In t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014